The Ellogon Pattern Engine: Context-free Grammars over Annotations
نویسنده
چکیده
This paper presents the pattern engine that is offered by the Ellogon language engineering platform. This pattern engine allows the application of context-free grammars over annotations, which are metadata generated during the processing of documents by natural language tools. In addition, grammar development is aided by a graphical grammar editor, giving grammar authors the capability to test
منابع مشابه
Exploiting Semantic Contextualization for Interpretation of Human Activity in Videos
We use large-scale commonsense knowledge bases, e.g. ConceptNet, to provide context cues to establish semantic relationships among entities directly hypothesized from video signal, such as putative object and actions labels, and infer a deeper interpretation of events than what is directly sensed. One approach is to learn semantic relationships between objects and actions from training annotati...
متن کاملIncrementally Inferring Context-Free Grammars for Domain-Specific Languages
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to the programming language problem domain has been limited. We propose a new application area for grammar inference which intends to make domain-specific language development easier and finds a second application in ren...
متن کاملSCFG latent annotation for machine translation
We discuss learning latent annotations for synchronous context-free grammars (SCFG) for the purpose of improving machine translation. We show that learning annotations for nonterminals results in not only more accurate translation, but also faster SCFG decoding.
متن کاملPattern Ambiguities for Pure Context{free Grammars Pattern Ambiguities for Pure Context{free Grammars Pattern Ambiguities for Pure Context{free Grammars
We consider here some special forms of ambiguity for pure context-free grammars, namely pattern avoiding ambiguity, pattern preserving ambiguity, pattern ambiguity, and grammar avoiding ambiguity. The rst two properties are undecidable for arbitrary pure context-free grammars, and in a particular but general enough case we can eeectively decide whether or not a pure context-free grammar is patt...
متن کاملOn the Computation of Distances for Probabilistic Context-Free Grammars
Probabilistic context-free grammars (PCFGs) are used to define distributions over strings, and are powerful modelling tools in a number of areas, including natural language processing, software engineering, model checking, bio-informatics, and pattern recognition. A common important question is that of comparing the distributions generated or modelled by these grammars: this is done through che...
متن کامل